Reactive GRASP for the strip-packing problem
نویسندگان
چکیده
منابع مشابه
Reactive GRASP for the strip-packing problem
This paper presents a greedy randomized adaptive search procedure (GRASP) for the strip packing problem, which is the problem of placing a set of rectangular pieces into a strip of a given width and infinite length so as to minimize the required length. We investigate several strategies for the constructive and improvement phases and several choices for critical search parameters. We perform ex...
متن کاملGRASP-VNS hybrid for the Strip Packing Problem
In this work we consider an hybrid metaheuristic approach to solve the Strip Packing Problem. In the hybrid algorithm, we use an Variable Neighbourhood Search (VNS) to improve the quality of part of the solution obtained with a Greedy Randomized Adaptive Search Procedure (GRASP). Then, the results achieved with the hybrid method are compared with those existing in the literature. From these res...
متن کاملMetaheuristics International Conference ? ? - 1 GRASP heuristic for the strip packing problem ∗
The rectangular Strip Packing Problem (SPP) consists of packing a given set of rectangles in a rectangular strip with fixed width w and variable height minimizing the height of the packing. In this work we propose a ”Greedy Randomized and Adaptive Constructive” heuristic, a GRASP metaheuristic without the post-processing phase, for the SPP in the version where the rectangles can be freely rotat...
متن کاملA Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کاملA Novel GRASP Algorithm for Solving the Bin Packing Problem
The Bin Packing Problem (BPP) is one of the most known combinatorial optimization problems. This problem consists in packing a set of items into a minimum number of bins. There are several variants of this problem; the most basic problem is the onedimensional bin packing problem (1-BPP). In this paper, we present a new approach based on the GRASP procedure to deal with the1-BPP problem. The fir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2008
ISSN: 0305-0548
DOI: 10.1016/j.cor.2006.07.004